Non-stochastic infinite and finite sequences
نویسندگان
چکیده
منابع مشابه
Inconstancy of finite and infinite sequences
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light a 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we introduce the inconstancy of a sequence and we show why it seems more pertinent than other criteria for measuring its variational complexity. We also compute ...
متن کاملStochastic Quantization of Field Theory in Finite and Infinite Volume
Using the theory of Dirichlet forms a distribution-valued symmetric Markov process is constructed so that it has the (qY')2 measure as its invariant probability measure. Several properties of this process are proved and a finite to infinite volume limit theorem is established.
متن کاملAlgorithmic Complexity and Stochastic Properties of Finite Binary Sequences
This paper is a survey of concepts and results related to simple Kolmogorov complexity, prefix complexity and resource-bounded complexity. We also consider a new type of complexity— statistical complexity closely related to mathematical statistics. Unlike other discoverers of algorithmic complexity, A. N. Kolmogorov’s leading motive was developing on its basis a mathematical theory more adequat...
متن کاملWhen Can Finite Testing Ensure Infinite Trustworthiness?
In this paper we contribute to the general philosophical question as to whether empirical testing can ever prove a physical law. Problems that lead to this question arise under several contexts, and the matter has been addressed by the likes of Bayes and Laplace. After pointing out that a Bayesian approach is the proper way to address this problem, we show that the answ...
متن کاملFinite and Infinite Packings
Let K E d , d 2, be a centrally symmetric convex body with volume V (K) > 0 and distance function f. be the density of a densest packing of n translates of K, where controls the innuence of the boundary. We show that for 2 lim sup n!1 where (K) is the classical densest innnite packing density of K. So we get a new approach to classical packings. For d = 2 we generalize classical results by Roge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00073-5